Computing a consistent approximation to a generalized pairwise comparisons matrix
نویسندگان
چکیده
منابع مشابه
An Algorithm for the Optimal Consistent Approximation to a Pairwise Comparisons Matrix by Orthogonal Projections
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comaprisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric. Orthogonal basis is introduced in the vector space. The orthogonal projection of the transformed matrix onto the space formed by the images of consistent matrices is ...
متن کاملOn the Optimal Consistent Approximation to Pairwise Comparison Matrices
Consistency retrieval from a biased relative preference table is an imperative task in decision theory This paper considers the least squares approximation of a pairwise comparison matrix by consistent matrices It is observed that the highly nonlinear manifold of consistent matrices can be changed into a linear subspace by the component wise logarithmic transformation A rst order optimality con...
متن کاملa 10-bit 50-ms/s parallel successive-approximation analog-to-digital converter
applications such as high definition viedeo reproduction, portable computers, wireless, and multimedia demand, and ever-increasing need for ligh-frequency high-resolution and low-power analog-to-digital converters. flash, two-step flash, and pipeline convertors are fast but consume large amount of power and require large area. to overcome these problems, successive approximation converter blo...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1999
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00048-6